Certain multiply transitive setwise stabilizers
نویسندگان
چکیده
منابع مشابه
Multiply Transitive Substitution Groups*
A substitution group G of degree n is said to be r-fold transitive if each of the n(n — 1) • • • (n—r + 1) permutations of its n letters taken r at a time is represented by at least one substitution of G. It is not sufficient to say that each of its possible sets of r letters is transformed into every one of these sets by the substitutions of G. For instance, in each of the semi-metacyclic grou...
متن کاملPermutation Groups with Multiply - Transitive Suborbits , Ii
In a previous paper with the same title [1], I considered the following situation; G is a primitive, not doubly transitive permutation group on Q, in which the stabiliser G a of a point a acts doubly transitively on an orbit F(a), where |F(a)| = v. Manning [3] showed that, if v > 2, then G a has an orbit larger than F(a). Indeed, with A = F* o T (see [1] for notation), it is easy to see that A(...
متن کاملQuartic half-arc-transitive graphs with large vertex stabilizers
A 1 2 -arc-transitive graph is a vertexand edgebut not arc-transitive graph. In all known constructions of quartic 1 2 -arc-transitive graphs, vertex stabilizers are isomorphic to Z 2,Z 2 2 or to D8. In this article, for each positive integer m ≥ 1, an infinite family of quartic 1 2 -arctransitive graphs having vertex stabilizers isomorphic to Z m
متن کاملA Simple Group Having No Multiply Transitive Representation
The totality of 4X4 matrices with coefficients in GF [22], determinant unity, and which permute among themselves the vectors of dimension 4 having 4 co-ordinates nonzero marks of GF [22], or 2 zeros and 2 nonzero marks of the field, forms a simple [l, p. 285, problem 9, part (4)]1 (multiplicative) group, G, of order 26-34-5. It will be demonstrated that G is isomorphic with no multiply transiti...
متن کاملSetwise intersecting families of permutations
A family of permutations A ⊂ Sn is said to be t-set-intersecting if for any two permutations σ, π ∈ A, there exists a t-set x whose image is the same under both permutations, i.e. σ(x) = π(x). We prove that if n is sufficiently large depending on t, the largest t-set-intersecting families of permutations in Sn are cosets of stabilizers of t-sets. The t = 2 case of this was conjectured by János ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1977
ISSN: 0021-8693
DOI: 10.1016/0021-8693(77)90384-2